An optimal design for hierarchical generalized group testing
نویسندگان
چکیده
منابع مشابه
Generalized Framework for Selectors with Applications in Optimal Group Testing
Group Testing refers to the situation in which one is given a set of objects O, an unknown subset P O, and the task is to determine P by asking queries of the type \does P intersect Q?", where Q is a subset of O. Group testing is a basic search paradigm that occurs in a variety of situations such as quality control in product testing, searching in storage systems, multiple access communications...
متن کاملAn Almost Optimal Algorithm for Generalized Threshold Group Testing with Inhibitors
Group testing is a search paradigm where one is given a population S of n elements and an P is a subset of S defective elements and the goal is to determine P by performing tests on subsets of S. In classical group testing a test on a subset Q is a subset of S receives a YES response if [formula: see text] ≥ 1, and a NO response otherwise. In group testing with inhibitors (GTI), identifying the...
متن کاملHierarchical group testing for multiple infections.
Group testing, where individuals are tested initially in pools, is widely used to screen a large number of individuals for rare diseases. Triggered by the recent development of assays that detect multiple infections at once, screening programs now involve testing individuals in pools for multiple infections simultaneously. Tebbs, McMahan, and Bilder (2013, Biometrics) recently evaluated the per...
متن کاملAn Efficient Bayesian Optimal Design for Logistic Model
Consider a Bayesian optimal design with many support points which poses the problem of collecting data with a few number of observations at each design point. Under such a scenario the asymptotic property of using Fisher information matrix for approximating the covariance matrix of posterior ML estimators might be doubtful. We suggest to use Bhattcharyya matrix in deriving the information matri...
متن کاملWhen is Individual Testing Optimal for Nonadaptive Group Testing?
The combinatorial group testing problem is, assuming the existence of up to d defectives among n items, to identify the defectives by as few tests as possible. In this paper, we study the problem for what values of n, given d, individual testing is optimal in nonadaptive group testing. Let N(d) denote the largest n for fixed d for which individual testing is optimal. We will show that N(d) = (d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Royal Statistical Society: Series C (Applied Statistics)
سال: 2020
ISSN: 0035-9254,1467-9876
DOI: 10.1111/rssc.12409